Constant-only multiplicative linear logic is NP-complete

Constant-Only Multiplicative Linear Logic is NP-Complete

Direct Encodings of NP-Complete Problems into Horn Sequents of Multiplicative Linear Logic

Linear Higher-Order Matching Is NP-Complete

We consider the problem of higher-order matching restricted to the set of linear λ-terms (i.e., λ-terms where each abstraction λx.M is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.

Constructing Fully Complete Models of Multiplicative Linear Logic

The multiplicative fragment of Linear Logic is the formal system in this family with the best understood proof theory, and the categorical models which best capture this theory are the fully complete ones. We demonstrate how the Hyland-Tan double glueing construction produces such categories, either with or without units, when applied to any of a large family of degenerate models. This process ...

Overloading is NP - complete

We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.